An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations
نویسندگان
چکیده
منابع مشابه
Power-optimal Simultaneous Buffer Insertion/sizing and Wire Sizing
This paper studies the problems of minimizing power dissipation of an interconnect wire by simultaneously considering buffer insertion/sizing and wire sizing (BISWS). We consider two cases, namely minimizing power dissipation with optimal delay constraints, and minimizing power dissipation with a given delay penalty. We derive closed form optimal solutions for both cases. These closed form solu...
متن کاملAn efficient and optimal algorithm for simultaneous buffer and wire sizing
In this paper, we consider the problem of interconnect delay minimization by simultaneous buffer and wire sizing under the Elmore delay model. We first present a polynomial time algorithm SBWS to minimize the delay of an interconnect wire. Previously, no polynomial time algorithm for the problem has been reported in the literature. SBWS is an iterative algorithm with guaranteed convergence to t...
متن کاملA quadratic programming approach to simultaneous buffer insertion/sizing and wire sizing
In this paper, we present a completely new approach to the problem of delay minimization by simultaneous buffer insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we explore some special properties of our problem and derive an optimal and very efficient algorithm modified...
متن کاملAn Time Algorithm for Optimal Buffer Insertion with Buffer Types
Buffer insertion is a popular technique to reduce the interconnect delay. The classic buffer insertion algorithm of van Ginneken has time complexity , where is the number of buffer positions. Lillis, Cheng and Lin extended van Ginneken’s algorithm to allow buffer types in time . For modern design libraries that contain hundreds of buffers, it is a serious challenge to balance the speed and perf...
متن کاملBu ered Steiner Tree Construction with Wire Sizing for Interconnect Layout Optimization
This paper presents an e cient algorithm for bu ered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm nds a Steiner tree with bu er insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2005
ISSN: 0278-0070
DOI: 10.1109/tcad.2005.844107